Comparison of Parallel APSP Algorithms
نویسنده
چکیده
منابع مشابه
Unified All-pairs Shortest Path Algorithms in the Chordal Hierarchy
The objective of this paper is to advance the view that solving the all-pairs shortest path (APSP) problem for a chordal graph G is a two-step process: the first step is determining vertex pairs at distance two (i.c., computing C’) and the second step is finding the vcrtcx pairs at distance three or more. The main technical result here is that the APSP problem for a chordal graph can be solved ...
متن کاملA comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملComparative Analysis of Floyd Warshall and Dijkstras Algorithm using Opencl
Shortest path algorithms finds applications in large real world domains. All pair shortest path (APSP) and single source shortest path (SSSP) both have their special applications domains. All though every SSSP can be applied for all vertices to calculate APSP. But APSP cant. In this paper heterogeneous implementation of Floyd warshalls algorithm and Dijkstra’s algorithm is compared on dense gra...
متن کاملAn Efficient APSP Algorithm
In many cases, recursion removal improves the efficiency of recursive algorithms, especially algorithms with large formal parameters, such as All Pair Shortest path (APSP) algorithms. In this article, a recursion removal of the Seidel’s APSP [14] is presented, and a general method of recursion removal, called stack indexation is introduced.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999